A new method for proving termination of AC-rewrite systems
Identifieur interne : 00DE61 ( Main/Exploration ); précédent : 00DE60; suivant : 00DE62A new method for proving termination of AC-rewrite systems
Auteurs : Deepak Kapur [États-Unis] ; G. Sivakumar [États-Unis] ; Hantao Zhang [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: A new method, which extends the lexicographic recursive path ordering of Dershowitz and Kamin and Levy, to prove termination of associative-commutative (AC) rewrite systems is proposed. Instead of comparing the arguments of an AC-operator using the multiset extension, we partition them into disjoint subsets and each subset is used only once for comparison. To preserve transitivity, we introduce two techniques—pseudocopying and elevating of arguments of an AC operator. This method imposes no restrictions at all on the underlying precedence relation on function symbols. It can therefore prove termination of a much more extensive class of AC rewrite systems, than previous methods such as associative path ordering which restrict AC operators to be minimal or sub-minimal in precedence. A number of examples illustrating the power of the approach are discussed. The method has been implemented in SUTRA (formerly called RRL, Rewrite Rule Laboratory), a theorem proving environment based on rewrite techniques and completion.
Url:
DOI: 10.1007/3-540-53487-3_40
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001643
- to stream Istex, to step Curation: 001624
- to stream Istex, to step Checkpoint: 003267
- to stream Main, to step Merge: 00E741
- to stream Main, to step Curation: 00DE61
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A new method for proving termination of AC-rewrite systems</title><author><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name></author><author><name sortKey="Sivakumar, G" sort="Sivakumar, G" uniqKey="Sivakumar G" first="G." last="Sivakumar">G. Sivakumar</name></author><author><name sortKey="Zhang, Hantao" sort="Zhang, Hantao" uniqKey="Zhang H" first="Hantao" last="Zhang">Hantao Zhang</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:605A37E62DDF9E905D4C3E066E42D8CBC7F0D44A</idno><date when="1990" year="1990">1990</date><idno type="doi">10.1007/3-540-53487-3_40</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-9D3F5KQG-J/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001643</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001643</idno><idno type="wicri:Area/Istex/Curation">001624</idno><idno type="wicri:Area/Istex/Checkpoint">003267</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003267</idno><idno type="wicri:doubleKey">0302-9743:1990:Kapur D:a:new:method</idno><idno type="wicri:Area/Main/Merge">00E741</idno><idno type="wicri:Area/Main/Curation">00DE61</idno><idno type="wicri:Area/Main/Exploration">00DE61</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A new method for proving termination of AC-rewrite systems</title><author><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">État de New York</region></placeName><wicri:cityArea>Computer Science Dept., State University of New York, 12222, Albany</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Sivakumar, G" sort="Sivakumar, G" uniqKey="Sivakumar G" first="G." last="Sivakumar">G. Sivakumar</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Delaware</region></placeName><wicri:cityArea>Computer Science Dept., University of Delware, 19716, Newark</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Zhang, Hantao" sort="Zhang, Hantao" uniqKey="Zhang H" first="Hantao" last="Zhang">Hantao Zhang</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Iowa</region></placeName><wicri:cityArea>Computer Science Dept., The University of Iowa, 52242, Iowa City</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A new method, which extends the lexicographic recursive path ordering of Dershowitz and Kamin and Levy, to prove termination of associative-commutative (AC) rewrite systems is proposed. Instead of comparing the arguments of an AC-operator using the multiset extension, we partition them into disjoint subsets and each subset is used only once for comparison. To preserve transitivity, we introduce two techniques—pseudocopying and elevating of arguments of an AC operator. This method imposes no restrictions at all on the underlying precedence relation on function symbols. It can therefore prove termination of a much more extensive class of AC rewrite systems, than previous methods such as associative path ordering which restrict AC operators to be minimal or sub-minimal in precedence. A number of examples illustrating the power of the approach are discussed. The method has been implemented in SUTRA (formerly called RRL, Rewrite Rule Laboratory), a theorem proving environment based on rewrite techniques and completion.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>Delaware</li><li>Iowa</li><li>État de New York</li></region></list><tree><country name="États-Unis"><region name="État de New York"><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name></region><name sortKey="Kapur, Deepak" sort="Kapur, Deepak" uniqKey="Kapur D" first="Deepak" last="Kapur">Deepak Kapur</name><name sortKey="Sivakumar, G" sort="Sivakumar, G" uniqKey="Sivakumar G" first="G." last="Sivakumar">G. Sivakumar</name><name sortKey="Sivakumar, G" sort="Sivakumar, G" uniqKey="Sivakumar G" first="G." last="Sivakumar">G. Sivakumar</name><name sortKey="Zhang, Hantao" sort="Zhang, Hantao" uniqKey="Zhang H" first="Hantao" last="Zhang">Hantao Zhang</name><name sortKey="Zhang, Hantao" sort="Zhang, Hantao" uniqKey="Zhang H" first="Hantao" last="Zhang">Hantao Zhang</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00DE61 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00DE61 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:605A37E62DDF9E905D4C3E066E42D8CBC7F0D44A
|texte= A new method for proving termination of AC-rewrite systems
}}
| This area was generated with Dilib version V0.6.33. |  |